maintain consist probabilist databas linear program approach discov signific relax order dpreserv submatric effici process group dorient connect queri larg graph mrm adapt framework xml search mrm adapt framework xml search context dawar object connect discoveri larg graph context dawar object connect discoveri larg graph maintain consist vagu databas data depend develop prefer band model manag collect prefer discov bucket order full rank correl pattern mine quantit databas effect elimin redund associ rule person concept dbase cluster search engin queri abstract major problem current web search search queri short ambigu insuffici precis user allevi problem search engin suggest term semant relat submit queri user choos suggest reflect inform paper introduc effect approach captur user conceptu prefer order provid person queri suggest achiev goal strategi develop onlin techniqu extract concept web snippet search result return queri concept identifi relat queri queri propos twophas person agglom cluster algorithm gener person queri cluster author knowledg previou work address person queri suggest evalu effect techniqu googl middlewar develop collect clickthrough data conduct experiment evalu experiment result show approach precis recal exist queri cluster method index term clickthrough concept base cluster person queri cluster search engin effici correl search graph databas effici correl search graph databas survei algorithm mine frequent itemset data stream increas promin data stream aris wide rang advanc applic fraud detect trend learn led studi onlin mine frequent itemset fi unlik mine static databas mine data stream pose challeng addit scan natur unbound memori requir high data arriv rate data stream combinatori explos itemset exacerb mine task high complex fi mine problem hinder applic stream mine techniqu recogn critic review exist techniqu need order design develop effici mine algorithm data structur match process rate mine high arriv rate data stream unifi set notat terminolog describ paper effort main techniqu mine data stream present compr hensiv survei number state art algorithm mine frequent itemset data stream classifi stream mine techniqu categori base window model adopt order provid sight techniqu analyz algorithm exact approxim approxi mate approach fals posit fals neg discuss interest issu includ merit limit exist research substant area futur research inform dtheoret approach quantit associ rule mine abstract quantit associ rule qar mine rec ogniz influenti research problem decad due popular quantit databas us associ ation rule real life unlik boolean associ rule bar boolean attribut qar consist quantit attribut richer inform boolean attribut combin quantit attribut terval rise gener explos larg number itemset sever degrad mine effici paper propos inform theoret approach avoid reward combin attribut interv gener mine process studi mutual inform attribut quantit databas devis normal izat mutual inform make applic context qar mine strong inform relationship multi dranker model adapt xml search divid apu float point unit compris execut unit regist file bu interfac control logic manag execut float point instruct figur overview float point unit fpu architectur adapt inform merg select xml fragment effici index lattic xml queri evalu develop hash dlookup tree support queri stream xml mine vagu associ rule abstract onlin shop applic tradit associ rule ar mine limit deal item sold ignor item sold item put basket check sold item carri hesit inform custom hesit bui hesit inform item valuabl knowledg design good sell strategi appli vagu set theori context ar mine incorpor hesit inform ar defin concept attract hesit item repres inform custom intent item base concept propos notion vagu associ rule var devis effici algorithm mine var experi show algorithm effici var captur specif richer inform tradit ar handl inconsist vagu relat function depend abstract vagu inform common databas applic due internet scale data dissemin data aris sensor network mobil commun formal notion vagu relat order model vagu data previou work paper util function depend fd fundament integr constraint aris practic relat databas maintain consist vagu relat problem tackl vagu relat schema set fd approxim respect take account median membership imprecis membership threshold threshold vagu set defin notion mi overlap vagu set merg oper satisfact fd defin term valu mi overlap show lien atzeni axiom system sound complet fd satisfi vagu relat studi chase procedur vagu relat name vchase mean maintain consist respect main result output procedur object precis approxim respect complex vchase polynomi time size priorit prefer choic constraint mine hesit inform vagu associ rule abstract onlin shop applic amazon ebai tradit associ rule ar mine limit deal item sold ignor item sold item put basket check sold item carri hesit inform custom hesit bui hesit inform item valuabl knowledg design good sell strategi conceptu model captur status hesit inform appli extend vagu set theori context ar mine defin concept attract hesit item repres inform custom intent item base concept propos notion vagu associ rule var devis effici algorithm mine var experi show algorithm effici var captur specif richer inform tradit ar correl search graph databas correl mine gain great success applic domain abil captur underli depend object research correl mine graph databas lack fact graph data scientif domain prolifer recent year paper propos problem correl mine graph databas call correl graph search cg cg adopt pearson correl coeffici correl measur consider occurr distribut graph problem pose signific challeng subgraph graph databas candid number subgraph exponenti deriv condit set bound occurr probabl candid databas result design effici algorithm oper smaller project databas obtain significantli smaller set candid improv effici develop heurist rule appli candid set reduc search space extens experi demonstr effect method candid reduct result justifi effici algorithm mine correl larg real synthet dataset mqx multi dqueri engin compress xml data fg dindex verif dfree queri process graph databas mine user prefer spy vote search engin person paper address search engin person present approach mine user prefer search result clickthrough data discov prefer adapt search engin rank function improv search qualiti develop prefer mine techniqu call spynb base practic assumpt search result click user reflect user prefer draw conclus result user click spynb valid user follow order read search result click relev result extens offlin experi demonstr spynb discov accur prefer exist algorithm interact onlin experi confirm spynb person approach effect practic show effici spynb compar exist simpl prefer mine algorithm mark leven posit dbase queri translat sql xql locat counter effici approach support queri secur outsourc xml inform abstract data secur recogn vital issu inform system support outsourc environ convent xml encrypt propos treat confidenti part xml document block text appli encrypt algorithm directli result queri involv encrypt part effici process order address problem propos xqenc approach support queri encrypt xml xqenc base import techniqu vector skeleton compress essenti vector gener column relat tabl make basic path xml tree label data valu skeleton compress collaps redund path multipl attribut analysi experiment studi show xqenc achiev queri effici robust secur compar convent method applic show xqenc realiz relat techniqu enabl secur xml data outsourc effici doper framework multi dqueri process compress xml data abstract xml de facto standard exchang present inform web xml data recogn verbos heavili inflat size data due repeat tag structur data verbos problem rise challeng convent distribut databas technolog paper studi xml dissemin problem internet speed inform deliveri slow server client architectur consist larg number geograph span user access larg amount correl xml inform problem sever user access close relat xml fragment case usag bandwidth ineffici order save bandwidth process queri effici propos architectur incorpor xml compress techniqu exploit result xpath contain framework demonstr load server reduc network bandwidth effici client benefit due save cost prefer function depend manag choic abstract notion user prefer databas model recent receiv attent advanc applic person servic captur human wish queri manag data paradigm prefer driven choic real world requir semant constraint model paper assum prefer constraint defin data domain assumpt rise prefer relat special case order relat schema consist prefer preferencedepend prefer independ attribut demonstr lexicograph order function depend lofd emploi maintain consist prefer semant embed prefer databas priorit multipl prefer repres defin semant constraint term set lofd call prefer function depend pfd order captur semant prefer rank data exhibit sound complet axiom system pfd implic problem shown decid polynomi time confirm exist armstrong prefer relat pfd fundament result relat practic pfd databas design mic framework inform dtheoret approach quantit associ rule mine delta dtoler close frequent itemset mine quantit correl pattern inform dtheoret approach exist research mine quantit databas focus mine associ mine associ expens practic case paper studi mine correl quantit databas show effect approach mine associ propos notion quantit correl pattern qcp found formal concept mutual inform confid devis normal mutual inform appli qcp mine captur depend attribut adopt confid qualiti measur control finer granular depend attribut specif quantit interv propos supervis method combin consecut interv quantit attribut base mutual inform interv combin guid depend attribut develop algorithm qcomin effici mine qcp util normal mutual inform confid perform level prune experi verifi effici qcomin qualiti qcp maintain frequent itemset high dspeed data stream abstract propos fals neg approach approxim set frequent itemset fi slide window exist approxim algorithm error paramet control accuraci mine result lead dilemma smaller accur mine result higher comput complex increas degrad mine accuraci address dilemma introduc progress increas minimum support function itemset retain window longer requir minimum support approach minimum support fi number potenti fi maintain greatli reduc experi show algorithm attain highli accur mine result run significantli faster consum memori exist algorithm mine fi slide window web dynam ramif develop web search engin world wide web largest hypertext system exist provid extrem rich collect inform resourc compar convent inform sourc web highli dynam factor size grow number web site page web page page content page exist hyperlink structur user search popular import tool find inform web web search engin face challeng aris web dynam paper survei research issu web dynam discuss search engin address factor web dynam briefli discuss main issu direct futur develop web search engin xcq queriabl xml compress system compar analysi xml compress technolog effect approach watermark xml data abstract watermark enabl provabl right content successfulli appli multimedia applic trivial appli effect watermark scheme xml data noisi data accept due structur node extent paper present watermark scheme xml data select approach compress approach emb destruct hidden inform content xml data take verbos updat xml data real life account conduct experi effici robust approach form attack show propos watermark scheme effici effect unifi framework merg evalu xml inform vagu set intuitionist fuzzi set handl vagu data abstract real world vagu data valu applic sensor inform fuzzi set theori propos handl vagu gener notion membership set essenti fuzzi set fs element point select unit interv term grade membership set vagu set intuitionist fuzzi set if gener fs point base membership fss interv base membership interv base membership vss express captur vagu data literatur notion ifss vss regard equival sens if isomorph due equival ifss earlier tradit interest featur handl vagu data uniqu vss larg paper attempt make comparison vss ifss perspect algebra properti graphic represent practic applic find interest differ data model point view incorpor notion vss relat describ vagu sql vsql extens sql vagu relat model show vsql combin capabl standard sql power manipul vagu relat vsql minim extens illustr usag vsql user formul wide rang queri occur mode interact vagu data queri appli dtrain clickthrough data search engin adapt inform world wide web grow bound user diversifi prefer page target search engin challeng task adapt search engin suit commun user share similar interest paper propos algorithm rank svm train framework rscf essenti rscf algorithm take clickthrough data item search result click user input gener adapt ranker output appli dtrain clickthrough data search engin adapt inform world wide web grow bound user diversifi prefer page target search engin challeng task adapt search engin suit commun user share similar interest paper propos algorithm rank svm train framework rscf essenti rscf algorithm take clickthrough data item search result click user input gener adapt ranker output xqzip queri compress xml structur index abstract xml make data flexibl represent easili portabl web substanti inflat data size consequ tag describ data effect xml compressor xmill recent propos solv data inflat problem address problem run queri compress xml data recent compressor propos queri compress xml data compress ratio compressor wors xmill gener compressor gzip queri perform express power queri languag support inadequ paper propos xqzip xml compressor support queri compress xml data impos index structur call structur index tree sit xml data xqzip address compress queri perform problem exist xml compressor evalu xqzip perform extens wide spectrum benchmark xml data sourc averag xqzip achiev compress ratio queri time time queriabl xml compressor addit xqzip support wide scope xpath queri multipl deepli nest predic aggreg manag merg data vagu function depend abstract paper propos similar measur vagu set appli vagu logic relat databas environ object captur vagu data introduc vagu similar equal seq compar data valu gener classic function depend fd vagu function depend vfd present set sound complet infer rule final studi valid process vfd examin satisfact degre vfd merg union merg intersect vagu relat wuml web usag manipul languag queri web log data abstract paper develop web usag manipul languag wuml declar languag manipul web log data assum set trail form user navig process identifi web log file trail dualli model transit graph navig matrix respect underli web topolog wuml express execut transform navig log algebra nla consist sum union differ intersect project select power group oper real navig matric spars perform rang experi studi impact matrix storag scheme perform nla spy accur user prefer search engin adapt abstract exist search engin emploi static rank algorithm adapt specif user recent research studi clickthrough data adapt search engin rank function clickthrough data queri result click user kind implicit relev feedback inform clickthrough data easili collect search engin clickthrough data spars incomplet challeng discov accur user prefer paper propos algorithm call spy na ve bay spynb identifi user prefer gener clickthrough data treat result item click user posit exampl click user unlabel data plant posit exampl spi unlabel set result item appli na ve bay classif gener reliabl neg exampl posit neg exampl discov accur user prefer final emploi spynb algorithm rank svm optim build adapt metasearch engin experiment result show compar origin rank spynb significantli improv averag rank user click store queri xml data nest relat sequenc databas system repair inconsist merg xml data queri xml data nest relat sequenc databas system refin web authorit resourc frequent structur manag xml nest relat sequenc databas system index manag order structur xml data nest relat sequenc databas system xcq xml compress queri system adapt web interfac develop order sql packag peer dto dpeer wareh environ adapt web interfac conceptu tree model web reorgan web interact model web usag studi maintain consist integr xml tree maintain consist integr xml tree captur semant weg log data navig matric implement support web usag manag extens relat data model incorpor order domain extend relat data model incorpor partial order data domain call order relat model extend model defin partial order relat algebra pora allow order predic formula select oper pora express set relat invari order preserv automorph databas result characteris express pora justifi develop order sql osql queri languag order databas osql user capabl captur semant order data advanc applic tempor incomplet inform order function depend ofd order databas studi base extens domain order pointwis order lexicograph order present sound complet axiom system ofd case establish set sound complet chase rule ofd result suggest implic problem case ofd decid enforc ofd order relat practic feasibl wider perspect propos model explor import area object relat databas order domain view gener kind data type categori subject descriptor databas manag logic design data develop order sql packag support data wareh data wareh corpor strategi integr inform sourc separ develop databas manag system dbmss futur dbm data warehous provid adequ facil manag wide rang inform aris integr propos capabl databas languag enhanc manipul user defin data order busi queri enterpris involv order extend relat model incorpor partial order data domain describ order relat model defin implement minim extens sql call osql queri order relat databas import facil provid osql user captur underli semant order data applic demonstr osql aid packag disciplin effect mean manag interrel oper underli data domain wide rang advanc applic vital data wareh tempor incomplet fuzzi inform present detail gener oper aris applic form osql packag call osql time osql incomp osql fuzzi data wareh corpor strategi address broad rang decis support requir order kei attribut databas design queri databas knowledg domain extend function depend indefinit sequenc relat order function depend relat databas abstract extend relat data model incorpor linear order data domain call order relat model convent function depend fd examin context order relat databas notion system order independ soi refer desir scenario order tupl relat independ implement underli dbm extend armstrong axiom system fd object relat subclass order relat view tupl object formal de ne order function depend ofd extend model mean extens domain pointwis order lexicograph order rst present sound complet axiom system ofd case pointwis order establish sound complet set chase rule ofd case lexicograph order main result show implic problem case ofd decid lexicograph order function depend applic tempor relat order function depend relat databas abstract extend relat data model incorpor linear order data domain call order relat model convent function depend fd examin context order relat databas notion system order independ soi refer desir scenario order tupl relat independ implement underli dbm extend armstrong axiom system fd object relat subclass order relat view tupl object formal de ne order function depend ofd extend model mean extens domain pointwis order lexicograph order rst present sound complet axiom system ofd case pointwis order establish sound complet set chase rule ofd case lexicograph order main result show implic problem case ofd decid infer function depend linerli order databas infer function depend linerli order databas develop order sql packag model advanc applic osql extens sql manipul order relat databas 